1979B - XOR Sequences - CodeForces Solution

def count_trailing_zeros(n):
    if n == 0:
        return 32      count = 0
    while (n & 1) == 0:
        n >>= 1
        count += 1
    return count

def solve(x, y):
    d = x ^ y
    trailing_zeros = count_trailing_zeros(d)
    longest_subsegment_length = 1 << trailing_zeros
    return longest_subsegment_length

t = int(input().strip())
for _ in range(t):
    x, y = map(int, input().strip().split())
    print(solve(x, y))